Random stable-type minimal factorizations of the <i>n</i>-cycle
نویسندگان
چکیده
Abstract We investigate random minimal factorizations of the n -cycle, that is, permutation $(1 \, 2 \cdots n)$ into a product cycles $\tau_1, \ldots, \tau_k$ whose lengths $\ell(\tau_1), \ell(\tau_k)$ satisfy minimality condition $\sum_{i=1}^k(\ell(\tau_i)-1)=n-1$ . By associating to cycle factorization black polygon inscribed in unit disk, and reading one after another, we code by process colored laminations disk. These new objects are compact subsets made red noncrossing chords delimiting faces either or white. Our main result is convergence this as $n \rightarrow \infty$ , when randomly chosen according Boltzmann weights domain attraction an $\alpha$ -stable law, for some $\alpha \in (1,2]$ The limiting interpolates between circle version Kortchemski’s lamination. principal tool study bijection model size-conditioned labeled trees vertices white, well investigation asymptotic properties these trees.
منابع مشابه
the investigation of the relationship between type a and type b personalities and quality of translation
چکیده ندارد.
Minimal transitive factorizations of a permutation of type (p, q)
We give a combinatorial proof of Goulden and Jackson’s formula for the number of minimal transitive factorizations of a permutation when the permutation has two cycles. We use the recent result of Goulden, Nica, and Oancea on the number of maximal chains of annular noncrossing partitions of type B. Résumé. Nous donnons une preuve combinatoire de formule de Goulden et Jackson pour le nombre de f...
متن کاملThe relationship of skin type with minimal erythema dose (MED)
Background: Phototherapy is an important modality in dermatology and the number of skin diseases which can be controlled with it is increasing. In order to start treatment, the first dose of phototherapy is determined by measurement of minimal erythema dose (MED) in each patients individually or according to patient’s skin type. Objective: To determine the relationship of skin type with MED in ...
متن کاملMinimal Transitive Factorizations of Permutations into Cycles
We introduce a new approach to an enumerative problem closely linked with the geometry of branched coverings, that is, we study the number Hα(i2, i3, . . . ) of ways a given permutation (with cycles described by the partitionα) can be decomposed into a product of exactly i2 2-cycles, i3 3-cycles, etc., with certain minimality and transitivity conditions imposed on the factors. The method is to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Probability
سال: 2022
ISSN: ['1475-6064', '0001-8678']
DOI: https://doi.org/10.1017/apr.2021.21